Geometric Shape Preservation in Adaptive Refinement of Finite Element Meshes

ثبت نشده
چکیده

This thesis presents a vertex repositioning based boundary smoothing technique so that the finite element mesh, as refined, converges to the geometric shape of the domain. Adaptive mesh refinements based on a posteriori error estimates is already available within FEniCS, a free software for automated solution of differential equations. However, as the refinement process runs independently of the CAD (Computer-Aided Design) data, once the initial mesh is created the geometric shape is fixed and remains unchanged. The proposed technique removes this limitation enabling the mesh to be reshaped during the mesh refinement process according to the geometry. In the proposed technique, upon mesh refinements, the boundary vertices are repositioned to the orthogonal projection point on to the surface geometry. Newton iteration based iterative closest point algorithms have been used to search points projection on to the geometry represented as NURBS (Nonuniform Rational B-splines). For the new boundary vertices, old neighbor-nodes’ projection data have been used for obtaining an initial guess for the Newton’s iteration. Projection parameters for the boundary vertices of an initial coarse mesh is gathered using exhaustive search for points projection on the whole geometry. Once the mesh boundary vertices are repositioned, positions of the internal vertices are adjusted using mesh smoothing. Experimental results show that the method is sufficiently accurate and efficient for both 2D and 3D problems for some simple test cases. Inverted cells, which could invalidate the mesh, are not developed. Cell based mesh quality analysis and time performance analysis have been presented. Experimentally, it has been shown that using the proposed technique it is sufficient to start with a coarse mesh all over the domain and adaptively refine the mesh and the coarse mesh, as refined, captures the curved geometry more accurately. Since the proposed technique does not change the mesh topology and the finite element solver or mesh elements are not required to be changed, the developed tools can be plugged in to the finite element solver without much involvements. Although the tools are developed to become integrated parts of FEniCS, the parts representing geometric data manipulation can be used with other applications as well. Implementations in this thesis are limited for single NURBS patch geometry only and recommendations are given for future improvements to incorporate multiple patch NURBS geometry and trimmed NURBS.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Octasection-based Refinement of Finite Element Approximations on Tetrahedral Meshes that Guarantees Shape Quality

Adaptive refinement of finite element approximations on tetrahedral meshes is generally considered to be a non-trivial task. (We wish to stress that this paper deals with mesh refinement as opposed to remeshing.) The splitting individual finite elements needs to be done with much care to prevent significant deterioration of the shape quality of the elements of the refined meshes. Considerable c...

متن کامل

Delaunay Mesh Generation of Three Dimensional Domains

Delaunay meshes are used in various applications such as finite element analysis, computer graphics rendering, geometric modeling, and shape analysis. As the applications vary, so do the domains to be meshed. Although meshing of geometric domains with Delaunay simplices have been around for a while, provable techniques to mesh various types of three dimensional domains have been developed only ...

متن کامل

With a new refinement paradigm towards anisotropic adaptive FEM on triangular meshes

Adaptive anisotropic refinement of finite element meshes allows to reduce the computational effort required to achieve a specified accuracy of the solution of a PDE problem. We present a new approach to adaptive refinement and demonstrate that this allows to construct algorithms which generate very flexible and efficient anisotropically refined meshes, even improving the convergence order compa...

متن کامل

Unstructured Geometric Multigrid in Two and Three Dimensions on Complex and Graded Meshes

The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or the mesh has adaptive refinement. We introduce a simplification of a general topologically-motivated mesh coarsening algorithm for use in creating hierarchies of meshes for geometr...

متن کامل

Three-dimensional h-adaptivity for the multigroup neutron diffusion equations

Adaptive mesh refinement (AMR) has been shown to allow solving partial differential equations to significantly higher accuracy at reduced numerical cost. This paper presents a state-of-the-art AMR algorithm applied to the multigroup neutron diffusion equation for reactor applications. In order to follow the physics closely, energy group-dependent meshes are employed. We present a novel algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010